Linear grammar - PDFSEARCH.IO - Document Search Engine

Linear grammar
Results: 36

#	Item
11	Context-Free Languages∗ Jean Berstel Luc Boasson June 8, 2008 Add to Reading List Source URL: www-igm.univ-mlv.fr Language: English - Date: 2008-06-08 00:54:52 Linguistics Context-free grammar Formal grammar Linear grammar Pushdown automaton Ambiguous grammar Controlled grammar Context-sensitive grammar Formal languages Grammar Theoretical computer science
12	Context-Free Languages∗ Jean Berstel Luc Boasson June 8, 2008 Add to Reading List Source URL: www-igm.univ-mlv.fr Language: English - Date: 2008-06-08 00:54:52 Linguistics Context-free grammar Formal grammar Linear grammar Pushdown automaton Ambiguous grammar Controlled grammar Context-sensitive grammar Formal languages Grammar Theoretical computer science
13	Context-Free Languages and Pushdown Automata Jean-Michel Autebert1 , Jean Berstel2 , and Luc Boasson3 1 2 3 Add to Reading List Source URL: www-igm.univ-mlv.fr Language: English - Date: 2009-04-11 04:05:34 Context-free language Linear grammar Context-free grammar Formal grammar Vector space Nested word Pushdown automaton Formal languages Algebra Mathematics
14	A Classifier-Based Parser with Linear Run-Time Complexity Kenji Sagae and Alon Lavie Language Technologies Institute Carnegie Mellon University Pittsburgh, PA 15213 Add to Reading List Source URL: people.ict.usc.edu Language: English - Date: 2012-01-18 20:15:34 Parser generators Compiler construction Formal languages Parsing Bottom-up parsing SYNTAX Parse tree GOLD Stochastic context-free grammar Programming language implementation Software engineering Computing
15	Packrat Parsing: a Practical Linear-Time Algorithm with Backtracking by Bryan Ford Submitted to the Department of Electrical Engineering and Computer Science Add to Reading List Source URL: bford.info Language: English - Date: 2010-09-29 09:18:52 Software engineering Computing Compiler construction Parsing expression grammar Syntactic predicate Top-down parsing LL parser Recursive descent parser Bottom-up parsing Formal languages Programming language implementation Parsing
16	Lower Bounds for Context-Free Grammars Yuval Filmusa,1,∗ a University of Toronto Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2015-04-19 22:24:10 Applied mathematics Context-free grammar Regular language Constructible universe Formal grammar Controlled grammar Theorems and definitions in linear algebra Formal languages Mathematics Theoretical computer science
17	(2) Conlanging and the Linear Aspects of Syntax Doug Ball Stanford University, Dept. of Linguistics April 23, 2006 Add to Reading List Source URL: conlang.org Language: English - Date: 2014-01-22 13:59:56 Syntactic categories Generative linguistics Philosophy of language Semiotics Theta role Phrase structure rules Verb phrase Adpositional phrase Word order Linguistics Syntax Grammar
18	Section 14.2 A Hierarchy of Languages Context-Sensitive Languages A context-sensitive grammar has productions of the form xAz → xyz, where A is a nonterminal and x, y, z are strings of grammar symbols with y ≠ Λ. Th Add to Reading List Source URL: web.cecs.pdx.edu Language: English - Date: 2010-12-18 13:22:30 Mathematics Applied mathematics Computability theory Complexity classes Recursively enumerable language Unrestricted grammar Computability Linear bounded automaton Context-sensitive language Formal languages Theoretical computer science Theory of computation
19	Concise Integer Linear Programming Formulations for Dependency Parsing ∗ Andr´e F. T. Martins∗† Noah A. Smith∗ Eric P. Xing∗ School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-05-19 09:57:02 Compiler construction Formal languages LL parser Dependency grammar Linear programming Parse tree Conditional random field Combinatory logic Directed graph Mathematics Graph theory Theoretical computer science
20	On the Expressivity of Linear Transductions Chris Quirk Markus Saers and Dekai Wu Microsoft Research Human Language Technology Center One Microsoft Way, Redmond Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2011-10-12 03:26:22 Compiler construction Permutations Formal grammar Weak generative capacity Context-free grammar Inversion Parsing Formal languages Mathematics Combinatorics